The greatest common divisor and other triangular norms on the set of natural numbers
نویسنده
چکیده
This paper deals with triangular norms and conorms defined on the extended set N of natural numbers ordered by divisibility. From the fundamental theorem of arithmetic, N can be identified with a lattice of functions from the set of primes to the complete chain {0, 1, 2, ...,+∞}, thus our knowledge about (divisible) t-norms on this chain can be applied to the study of t-norms on N. A characterization of those t-norms on N which are a direct product of tnorms on {0, 1, 2, ...,+∞} is given and, after introducing the concept of T -prime (prime with respect to a tnorm T ), a theorem about the existence of a T -prime decomposition is obtained. This result generalizes the fundamental theorem of arithmetic.
منابع مشابه
A Compromise Ratio Ranking Method of Triangular Intuitionistic Fuzzy Numbers\ and Its Application to MADM Problems
Triangular intuitionistic fuzzy numbers (TIFNs) is a special case of intuitionistic fuzzy (IF) set and the ranking of TIFNs is an important problem. The aim of this paper is to develop a new methodology for ranking TIFNs by using multiattribute decision making methods (MADM). In this methodology, the value and ambiguity indices of TIFNs may be considered as the attributes and the TIFNs in compa...
متن کاملMathematical Harmony Analysis
Musical chords, harmonies or melodies in Just Intonation have note frequencies which are described by a base frequency multiplied by rational numbers. For any local section, these notes can be converted to some base frequency multiplied by whole positive numbers. The structure of the chord can be analysed mathematically by finding functions which are unchanged upon chord transposition. These fu...
متن کاملNumerical investigation of natural convection phenomena in uniformly heated trapezoidal Cylinder inside an elliptical Enclosure
A numerical study of the natural convection of the laminar heat transfers in the stationary state was developed in a horizontal ring and compared between a heated trapezoidal internal cylinder and a cold elliptical outer cylinder. This annular space is traversed by a Newtonian and incompressible fluid. The Prandtl number is set to 0.7 (air case) for different Rayleigh numbers. The system of equ...
متن کاملThe complexity of greatest common divisor computations
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal set of multipliers with respect to either the L0 metric or the L∞ norm. We present and analyze a new method for expressing the gcd of n numbers as their linear combination and give an upper bound on the size of the lar...
متن کاملGreatest common divisor
In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), highest common factor (hcf), or greatest commonmeasure (gcm), of two or more integers (when at least one of them is not zero), is the largest positive integer that divides the numbers without a remainder. For example, the GCD of 8 and 12 is 4.[1][2] This notion can be extended to polynomials, see ...
متن کامل